Specifying and Verifying Concurrent Algorithms with Histories and Subjectivity Extended version Ilya Sergey, Aleksandar Nanevski, and Anindya Banerjee IMDEA Software Institute, Spain {ilya.sergey, aleks.nanevski, anindya

Source URL: ilyasergey.net

• Logic in computer science
• Separation logic
• Substructural logic

Call for Nominations Editor-In-Chief ACM Transactions on Computational Logic The term of the current Editor-in-Chief (EiC) of the ACM Transactions on Computational Logic (TOCL) is coming to an end, and the ACM Publicatio

Source URL: tocl.acm.org

• Logic in computer science
• Computer scientists
• ACM Transactions on Computational Logic
• ACM SIGLOG
• Victor Vianu
• Computational logic
• Prakash Panangaden
• Association for Computing Machinery

Scala for TAPL’ers Part 2 Ilya Sergey Substitutions vs Closures Parsing

Source URL: ilyasergey.net

• Software engineering
• Computing
• Computer programming
• Lambda calculus
• Automated theorem proving
• Logic programming
• Subroutines
• Logic in computer science
• Substitution
• Closure
• Free variables and bound variables
• Term

Compositional CompCert Andrew W. Appel tifact * Complete

Source URL: www.cs.princeton.edu

• Software engineering
• Computing
• Software
• Logic in computer science
• Formal methods
• Compiler construction
• Cross-platform software
• Object-oriented programming languages
• Stack
• Semantics
• Optimizing compiler
• Operational semantics

On Symmetric Circuits and FPC Anuj Dawar University of Cambridge Computer Laboratory joint work with Matthew Anderson

Source URL: highlights-conference.org

• Complexity classes
• Theory of computation
• Theoretical computer science
• Circuit complexity
• Computational complexity theory
• Computer science
• Boolean circuit
• Logic in computer science
• NC
• P
• Circuit
• FO

Focusing and Polarization in Intuitionistic Logic Chuck Liang1 and Dale Miller2 1 Department of Computer Science, Hofstra University, Hempstead, NYchuck.liang at hofstra.edu

Source URL: www.cs.hofstra.edu

First-Order Logic vs. Fixed-Point Logic in Finite Set Theory Albert Atserias Computer Science Department University of California Santa Cruz, CA 95064

Source URL: www.cs.upc.edu

Semantics for a fragment of LOTOS with functional data and abstract datatypes Alan Jeffrey, University of Sussex Input document of ISO/IEC JTC1/SC21/WG7 ‘Enhancements to LOTOS’ Li`ege meeting, December 19

Source URL: ect.bell-labs.com

• Logic in computer science
• Programming language semantics
• Type theory
• Logic programming
• Automated theorem proving
• Operational semantics
• Substitution
• Syntax
• Type system
• Semantics
• C++ classes
• Monad

Electronic Notes in Theoretical Computer Science 86 NoURL: http://www.elsevier.nl/locate/entcs/volume86.html 21 pages Failure and Equality in Functional Logic Programming ? F. J. L´opez-Fraguas and J. S´anch

Source URL: gpd.sip.ucm.es

Electronic Notes in Theoretical Computer ScienceURL: http://www.elsevier.nl/locate/entcs/volume83.html 32 pages Secure Protocol Composition Anupam Datta 1 Ante Derek 1 John C. Mitchell 1 Computer Science Depar

Source URL: seclab.stanford.edu

• Logic
• Mathematics
• Abstraction
• Formal languages
• Mathematical logic
• Linear temporal logic
• Temporal logic
• Automated theorem proving
• Propositional calculus
• Substitution
• IP
• Interpretation